منابع مشابه
On completeness of word reversing
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this method to be complete in the sense that every pair of equivalent words can be detected by word reversing. In addition, we obtain explicit upper bounds on the complexity of the process. As an application, we show that...
متن کاملOn Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group presentation only. We give a counter-example to this conjecture, but, on the other hand, we establish length upper bounds for the case when only right reversing ...
متن کاملReversing the Standard Neural Signature of the Word-Nonword Distinction
The distinction between letter strings that form words and those that look and sound plausible but are not meaningful is a basic one. Decades of functional neuroimaging experiments have used this distinction to isolate the neural basis of lexical (word level) semantics, associated with areas such as the middle temporal, angular, and posterior cingulate gyri that overlap the default mode network...
متن کاملRemarks on completeness of lattice-valued Cauchy spaces
We study different completeness definitions for two categories of lattice-valued Cauchy spaces and the relations between these definitions. We also show the equivalence of a so-called completion axiom and the existence of a completion.
متن کاملOn Reversing Jensen's Inequality
Alex Pentland MIT Media Lab Cambridge, MA 02139 [email protected] Jensen's inequality is a powerful mathematical tool and one of the workhorses in statistical learning. Its applications therein include the EM algorithm, Bayesian estimation and Bayesian inference. Jensen computes simple lower bounds on otherwise intractable quantities such as products of sums and latent log-likelihoods. This s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00149-7